Structural uniformity of neocortex, revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structural uniformity of neocortex, revisited.

The number of neurons under a square millimeter of cortical surface has been reported to be the same across five cortical areas and five species [Rockel et al. (1980) Brain 103(2):221-244] despite differences in cortical thickness between the areas. Although the accuracy of this result has been the subject of sharp debate since its publication approximately 30 y ago, the experiments of Rockel e...

متن کامل

The Semicontinuous Quasi-uniformity of a Frame, Revisited

In this note we present a new treatment of the pointfree version of the semicontinuous quasi-uniformity based on the new tool of the ring of arbitrary (not necessarily continuous) real-valued functions made available recently by J. Gutiérrez Garćıa, T. Kubiak and J. Picado [Localic real functions: a general setting, Journal of Pure and Applied Algebra 213 (2009) 1064-1074]. The purpose is to sh...

متن کامل

a structural survey of the polish posters

تصویرسازی قابلیتهای فراوانی را دارا است

15 صفحه اول

Non-uniformity of neocortex: areal heterogeneity of NADPH-diaphorase reactive neurons in adult macaque monkeys.

We have examined the distribution of cortical neurons in adult monkey cortex which stain for nicotinamide adenine dinucleotide phosphate diaphorase (NADPH-d), an enzyme which is involved in the synthesis of nitric oxide. In order to compare distributions across areas we employed a cortical unit defined as the radial column, which refers to the volume of cortex below 1 mm(2) of cortical surface....

متن کامل

Vertex Cover Structural Parameterization Revisited

A pseudoforest is a graph whose connected components have at most one cycle. Let X be a pseudoforest modulator of graph G, i. e. a vertex subset of G such that G−X is a pseudoforest. We show that Vertex Cover admits a polynomial kernel being parameterized by the size of the pseudoforest modulator. In other words, we provide a polynomial time algorithm that for an input graph G and integer k, ou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Academy of Sciences

سال: 2013

ISSN: 0027-8424,1091-6490

DOI: 10.1073/pnas.1221398110